-
Notifications
You must be signed in to change notification settings - Fork 4
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Use lazy iterator to ensure all rings in create_[a/b]_list
are closed
#195
base: main
Are you sure you want to change the base?
Conversation
Ah, this breaks cut output because cut relies on the second ring not being closed. Maybe we have a pass through wrapper DontFix{T} for situations like this one? I could also make the lazy closed ring wrapper and wrap everything in intersection, difference, and union in that. In retrospect this seems like a better plan. |
We may need a dedicated wrapper type for this to be fast. |
Tests fail because this doesn't handle empty rings (I guess that it should be an empty ring in that case...) |
Fix #191 by ensuring that an extra point is effectively "vcat"'ed onto the stack, in case the polygon ring is not closed.
At some point this will change to use whatever struct we implement for the lazy polygon winding order / lazy polygon closed ring stuff, but for now this seems fit for purpose.